Minimal Tetrahedralizations of a Class of Polyhedra
نویسندگان
چکیده
Given an ordinary polyhedron P in the three dimensional Euclidean space, diierent tetrahedralizations of P may contain diierent numbers of tetrahedra. Minimal tetrahedralization is a tetrahedralization with the minimum number of tetrahedra. In this paper, we present some properties of the graph of polyhedra. Then we identify a class of polyhedra and show that this kind of polyhedra can be minimally tetrahedral-ized in O(n 2) time.
منابع مشابه
Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon
Given a convex polyhedron P and a convex polygon Q in ~3 such that Q's supporting plane does not intersect P, we are interested in tetrahedralizing the closure of the difference conve:c_hull(P U Q ) \ P; since P is convex, this difference is a connected nonconvex subset of T~ 3 which we call the region "between" P and Q. The problem is motivated by the work of Bern on tetrahedralizing the regio...
متن کاملThe Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere
In this paper, we consider two classes of polyhedra. One is the class of polyhedra of maximal volume with n vertices that are inscribed in the unit sphere of R. The other class is polyhedra of minimal volume with n vertices that are circumscribed about the unit sphere of R. We construct such polyhedra for n up to 30 by a computer aided search and discuss some of their properties.
متن کاملElementarily Equivalent Domains for Topological Languages over Regions in Euclidean Space
We prove that the class of rational polyhedra and the class of topologically regular regions definable in an o-minimal structure are each elementarily equivalent to the class of polyhedra for topological languages.
متن کاملCubic Polyhedra
A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears many (but not all) of them can be relaxed to smooth minimal surfaces (under an appropriate smoothing flow, keeping their symmetries). Here we give a complete classification of the cubic polyhedra. Among these are five new infi...
متن کاملOn Hamiltonian Tetrahedralizations Of Convex Polyhedra
Let Tp denote any tetrahedralization of a convex polyhedron P and let G be the dual graph of Tp such that each node of G T corresponds to a tetrahedron of Tp and two nodes are connected by an edge in G T if and only if the two corresponding tetrahedra share a common facet in Tp. Tp is called a Hamiltonian tetrahedralization if G contains a Hamiltonian path (HP). A wellknown open problem in comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 8 شماره
صفحات -
تاریخ انتشار 2000